Deterministic Cooperating Distributed Grammar Systems

Subclasses of grammar systems that can facilitate parser construction appear to be of interest. In this paper, some syntactical conditions considered for strict deterministic grammars are extended to cooperating distributed grammar systems, restricted to the terminal derivation mode. Two variants are considered according to the level to which the conditions address. The local variant, which introduces strict deterministic restrictions for each component of the system apart, results in local unambiguity of the derivations. Rather unexpected, the total variant, which extends the strict deterministic constraints at the level of the entire system, results in some cases in global unambiguity of the derivations. TUCS Research Group Mathematical Structures of Computer Science